CS369N: Beyond Worst-Case Analysis Lecture #7: Smoothed Analysis∗ Tim Roughgarden† November 30,

Source URL: theory.stanford.edu

• Operations research
• Computational complexity theory
• Linear programming
• Mathematical optimization
• Artificial neural networks
• Perceptron
• Simplex algorithm
• Smoothed analysis
• Algorithm
• Simplex
• Time complexity
• Polynomial

Recent Interactions between TCS and Quantum Physics Scott Aaronson September 2013 In 1994, when Peter Shor announced his famous algorithm for factoring integers in polynomial time using a quantum computer, it wasn’t ob

Source URL: thmatters.files.wordpress.com

• Quantum information science
• Quantum computing
• Quantum cryptography
• Quantum mechanics
• Emerging technologies
• Quantum algorithm
• Quantum information
• Quantum gravity
• Quantum complexity theory
• Theoretical computer science
• Boson sampling
• Quantum key distribution

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 9, Spring 2011

Source URL: courses.csail.mit.edu

• Analysis of algorithms
• Binary trees
• Computational complexity theory
• Asymptotic analysis
• Sorting algorithms
• Best
• worst and average case
• Binary heap
• Heap
• Time complexity
• Hash table
• Binary search tree
• Master theorem

RelaxMiddle-JSCStyle-sent.pdf

Source URL: www.csd.uwo.ca

• Multiplication
• Computational complexity theory
• Finite fields
• Multiplication algorithm
• Fast Fourier transform
• Factorial
• Time complexity
• XTR
• SchnhageStrassen algorithm
• Karatsuba algorithm

Algorithms and Data Structures Winter TermExercises for Unit 6 s 1. Spell out the general divide-and-conquer algorithm for multiplying polymomials that was

Source URL: www-tcs.cs.uni-sb.de

• Multiplication
• Binary operations
• Algebra
• Computational complexity theory
• Time complexity
• Polynomial
• Multiplication algorithm
• Karatsuba algorithm

Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem Alex Biryukov Dmitry Khovratovich

Source URL: www.internetsociety.org

• Computational complexity theory
• Theory of computation
• Complexity classes
• Analysis of algorithms
• Finite fields
• NP
• Spacetime tradeoff
• Algorithm
• Time complexity
• IP
• P
• XTR

Journal of Machine Learning Research2801 Submitted 1/08; Revised 9/08; PublishedRobust Submodular Observation Selection Andreas Krause

Source URL: select.cs.cmu.edu

• Computational complexity theory
• Theory of computation
• Mathematics
• Submodular set function
• Greedy algorithm
• Algorithm
• Optimization problem
• Reduction
• NP
• Time complexity

We live in a complex world, we often don’t know what is going on, and we won’t be able to understand its complexity unless we spend more time not knowingCuriosity is what we need - Margaret Wheatley

Source URL: www.ppunitedway.org

• Collective impact
• Philanthropy
• Social responsibility
• Collective
• Crowd psychology
• Social finance

CrowdAR: Augmenting Live Video with a Real-Time Crowd Elliot Salisbury, Sebastian Stein and Sarvapali D. Ramchurn Agents, Interaction and Complexity Research Group Department of Electronics and Computer Science Universit

Source URL: www.orchid.ac.uk

Why walking the dog takes time: Fr´echet distance has no strongly subquadratic algorithms unless SETH fails Karl Bringmann∗ April 10, 2014 Abstract

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Exponential time hypothesis
• Time complexity
• NC
• Gadget